Binary signed-digit integers and the Stern diatomic sequence
نویسندگان
چکیده
Stern’s diatomic sequence is a well-studied and simply defined with many fascinating characteristics. The binary signed-digit representation of integers an alternative much use in efficient computation, coding theory cryptography. We link these two ideas here, showing that the number i-bit representations integer n $$n<2^i$$ $$(2^i-n)^{\text {th}}$$ element sequence. This correspondence makes vast range results known for available consideration study integers.
منابع مشابه
On binary signed digit representations of integers
Applications of signed digit representations of an integer include computer arithmetic, cryptography, and digital signal processing. An integer of length n bits can have several binary signed digit (BSD) representations and their number depends on its value and varies with its length. In this paper, we present an algorithm that calculates the exact number of BSD representations of an integer of...
متن کاملRefining the Stern Diatomic Sequence
We refine the celebrated Stern Diatomic Sequence {b(n)}n≥0, in which b(n) is the number of partitions of n into powers of 2 for which each part has multiplicity 1 or 2, by studying the sequence {b(n, k)}n,k≥0, in which b(n, k) counts the partitions of n into powers of 2 in which exactly k parts have multiplicity 2, the remaining parts being of multiplicity 1. We find closed formulas for the b(n...
متن کاملOptimal Signed-Binary Representation for Integers
The signed-binary (SB) number system uses digits 0, 1, and –1 to recode integers. The SB representation for integers is very useful in computations for elliptic curve cryptography, digital signatures, and batch verifications, all of which are popular security solutions in today’s communication industry. What is an optimal SB representation? How to find it? This article gives easy-to-understand ...
متن کاملBinary partitions of integers and Stern-Brocot-like trees
We study partitions of an integer n in which all parts are powers of 2, no power of 2 appearing more than twice. If b(n) is the number of these, and B(n) = P j n b(j), then we nd (a) that gcd (b(n); b(n+ 1)) = 1, and that every coprime (i; j) occurs exactly once as a pair of consecutive values (b) the asymptotic behavior of B(t2), for xed 1 < t < 2, as n!1 (c) descriptions of b(n) in terms of t...
متن کاملOptimal Left-to-Right Binary Signed-Digit Recoding
This paper describes new methods for producing optimal binary signed-digit representations. This can be useful in the fast computation of exponentiations. Contrary to existing algorithms, the digits are scanned from left to right (i.e., from the most significant position to the least significant position). This may lead to better performances in both hardware and software.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2021
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-021-00903-6